Covering radius for sets of permutations
نویسندگان
چکیده
منابع مشابه
Covering radius for sets of permutations
We study the covering radius of sets of permutations with respect to the Hamming distance. Let f(n, s) be the smallest number m for which there is a set of m permutations in Sn with covering radius r ≤ n − s. We study f(n, s) in the general case and also in the case when the set of permutations forms a group. We find f(n, 1) exactly and bounds on f(n, s) for s > 1. For s = 2 our bounds are line...
متن کاملTransversals of Latin squares and covering radius of sets of permutations
We consider the symmetric group Sn as a metric space with the Hamming metric. The covering radius cr(S) of a set of permutations S ⊂ Sn is the smallest r such that Sn is covered by the balls of radius r centred at the elements of S. For given n and s, let f (n, s) denote the cardinality of the smallest set S of permutations with cr(S) 6 n − s. The value of f (n, 2) is the subject of a conjectur...
متن کاملPermutations and codes: Polynomials, bases, and covering radius
We will be considering sets of n-tuples over an alphabet A, in two important cases: A ¡ ¢ 0£ 1¤ (binary code); n¤ , all entries of each word distinct (set of permutations). We often impose closure conditions on these sets, as follows: A binary code is linear if it is closed under coordinatewise addition mod 2. A set of permutations is a group if it is closed under composition. x£ yïs the number...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.024